Hex

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Hex: Beyond Humans

For the first time, automated Hex solvers have surpassed humans in their ability to solve Hex positions: they can now solve many 9×9 Hex openings. We summarize the methods that attained this milestone, and examine the future of Hex solvers.

متن کامل

MOHEX Wins Hex Tournament

The 2011 Hex competition started on Sunday November 20 and finished on Monday November 21. Three programs competed: PANORAMEX by Fabien Teytaud, Tristan Cazenave, and Nicolas Jouandeau from France; WOLVE by Broderick Arneson, Ryan Hayward, and Philip Henderson from Canada; and MOHEX by Philip Henderson, Broderick Arneson, and Ryan Hayward. This year Aja Huang from Taiwan and Jakub Pawlewicz fro...

متن کامل

Solving 8x8 Hex

Using efficient methods that reduce the search space, we design an algorithm strong enough to solve all 8×8 Hex openings.

متن کامل

Monte-Carlo Hex

We present YOPT a program that plays Hex using Monte-Carlo tree search. We describe heuristics that improve simulations and tree search. We also address the combination of Monte-Carlo tree search with virtual connection search.

متن کامل

Solving 8×8 Hex

Using efficient methods that reduce the search space, we design an algorithm strong enough to solve all 8×8 Hex openings.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Iowa Review

سال: 2002

ISSN: 0021-065X,2330-0361

DOI: 10.17077/0021-065x.5622